Experimental Based Selection of Best Sorting Algorithm

Sorting algorithm is one of the most basic research fields in computer science. Sorting refers to the operation of arranging data in some given order such as increasing or decreasing, with numerical data, or alphabetically, with character data. There are many sorting algorithms. All sorting algorithms are problem specific. The particular Algorithm one chooses depends on the properties of the data and operations one may perform on data. Accordingly, we will want to know the complexity of each algorithm; that is, to know the running time f(n) of each algorithm as a function of the number n of input elements and to analyses the space and time requirements of our algorithms. Selection of best sorting algorithm for a particular problem depends upon problem definition. Comparisons of sorting algorithms are based on different scenario. This work experimentally analyzes the performance of various sorting algorithms by calculating the execution time.